Software Tools for Understanding Grammatical Inference Algorithms: Part I – Tools for Regular Grammars and Finite-State Automata
نویسندگان
چکیده
Software demonstrators are effective tools to show and understand scientific and engineering concepts in function, and they also allow rapid experiments. In the field of grammatical inference, there is a lack of “ready-to-use” grammar synthesis tools, with simple interfaces showing intermediate stages of the grammar inference process, and the presented work addresses this issue by giving tools for experimentation with regular grammar and finite-state automata, to help students and researchers understand their properties, underlying concepts and applications.
منابع مشابه
Current Trends in Grammatical Inference
Grammatical inference has historically found it’s first theoretical results in the field of inductive inference, but it’s first applications in the one of Syntactic and Structural Pattern Recognition. In the mid nineties, the field emancipated and researchers from a variety of communities moved in: Computational Linguistics, Natural Language Processing, Algorithmics, Speech Recognition, Bio-Inf...
متن کاملRecent Advances of Grammatical Inference
In this paper, we provide a survey of recent advances in the field “Grammatical Inference” with a particular emphasis on the results concerning the learnability of target classes represented by deterministic finite automata, context-free grammars, hidden Markov models, stochastic contextfree grammars, simple recurrent neural networks, and case-based representations.
متن کاملSoftware Support for Formal Languages Courses
An introductory formal languages course exposes students to automata theory, grammars, constructive proofs, computability, and decidability. This exposure usually comes late in the undergraduate curriculum or early in the graduate curriculum. In either setting, programming-oriented students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science...
متن کاملA Hybrid Connectionist-Symbolic Approach to Regular Grammatical Inference Based on Neural Learning and Hierarchical Clustering
l~ecently, recurrent neural networks (RNNs) have been used to infer regular grammars from positive and negative examples. Several clustering algorithms have been suggested to extract a finite state automaton (FSA) from the activation patterns of a trained net. However, the consistency with the examples of the extracted FSA is not guaranteed in these methods, and typically, some parameter of the...
متن کاملTree Automata and Tree Grammars
Preface I wrote these lecture notes during my stay in Aarhus in the academic year 1974/75. As a young researcher I had a wonderful time at DAIMI, and I have always been happy to have had that early experience. I wish to thank Heiko Vogler for his noble plan to move these notes into the digital world, and I am grateful to Florian Starke and Markus Napierkowski (and Heiko) for the excellent trans...
متن کامل